Averaging on n-dimensional rectangles
نویسندگان
چکیده
منابع مشابه
Learning Unions of omega(1)-Dimensional Rectangles
We consider the problem of learning unions of rectangles over the domain [b]n, in the uniform distribution membership query learning setting, where both b and n are “large”. We obtain poly(n, log b)-time algorithms for the following classes: • poly(n log b)-way MAJORITY of O( log(n log b) log log(n log b))-dimensional rectangles. • Union of poly(log(n log b)) many O( log (n log b) (log log(n lo...
متن کاملOn Group Averaging for SO(n,1)
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a ‘renormalized’ group averaging in certain models. The results of our study may indicate a general connection between superselection sectors and the rate of divergence of t...
متن کاملAnalysis of the N-dimensional Quadtree Decomposition for Arbitrary Hyper-rectangles
We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or`blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the formulae of previous eeorts for 2-dimensional spaces 8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hype...
متن کاملAveraging of incompressible flows on two-dimensional surfaces
We consider a process on a compact two-dimensional surface which consists of the fast motion along the stream lines of an incompressible periodic vector field perturbed by white noise. It gives rise to a process on the graph naturally associated to the structure of the stream lines of the unperturbed flow. It has been shown by Freidlin and Wentzell that if the unperturbed motion is periodic for...
متن کاملRectangles and Squares Recognized by Two-Dimensional Automata
Two-dimensional languages, or picture languages, are an interesting generalization of the standard languages of computer science. Rather than one-dimensional strings, we consider two-dimensional arrays of symbols over a finite alphabet. These arrays can then be accepted or rejected by various types of automata, and this gives rise to different language classes. Such classes may be of interest a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Mathematica
سال: 2017
ISSN: 1239-629X,1798-2383
DOI: 10.5186/aasfm.2017.4207